Backbone colorings of graphs with bounded degree
نویسندگان
چکیده
منابع مشابه
Backbone colorings of graphs with bounded degree
We study backbone colorings, a variation on classical vertex colorings: Given a graph G and a spanning subgraphH of G (the backbone of G), a backbone coloring for G and H is a proper vertex k-coloring of G in which the colors assigned to adjacent vertices in H differ by at least 2. The minimal k ∈ N for which such a coloring exists is called the backbone chromatic number of G. We show that for ...
متن کاملPolychromatic colorings of bounded degree plane graphs
A polychromatic k-coloring of a plane graph G is an assignment of k colors to the vertices of G such that every face of G has all k colors on its boundary. For a given plane graph G, we seek the maximum number k such that G admits a polychromatic k-coloring. We call a k-coloring in the classical sense (i.e., no monochromatic edges) that is also a polychromatic k-coloring a strong polychromatic ...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملColorings and homomorphisms of degenerate and bounded degree graphs
We are interested here in homomorphisms of undirected graphs and relate them to graph degeneracy and bounded degree property. Our main result reads that both in the abundance of counterexamples and from the complexity point of view the Brooks’s theorem and 5rst 5t algorithm are the ‘only’ easy cases. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملBounded Max-colorings of Graphs
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. In this paper we present complexity results and approximation algorithms for those problems on g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.11.015